Reshaping State-Space Search: From Dominance to Contrastive Analysis
نویسندگان
چکیده
State-space search is paramount for intelligent decision making when long-term thinking needed. We introduce dominance and contrastive analysis methods, which enable reasoning about the relative advantages among different courses of action. This re-shapes how agents reason leads to new families state-space algorithms.
منابع مشابه
Phased State Space Search
PS*, a new sequential tree searching algorithm based on the State Space Search (SSS*), is presented. PS*(k) divides each MAX node of a game tree into k partitions, which are then searched in sequence. By this means two major disadvantages of SSS*, storage demand and maintenance overhead, are significantly reduced, and yet the corresponding increase in nodes visited is not so great even in the r...
متن کاملcontrastive analysis زبانهای فارسی و فرانسه
مقایسه دو زبان فارسی و فرانسه در سطح آوایی موضوع پژوهش حاضر است . این مقایسه نشان داده است که زبان فرانسه دارای 18 همخوان و 10 واکه دهانی و 3 واکه غنه است . واکه های دهانی با مشخصات پیشین ˆ پسین و بازی ˆ بستگی و واکه های غنه با مشخصات غنه، لبی و پیشین ˆ پسین طبقه بندی شده اند. در زبان فارسی و فرانسه دیفتانگ وجود ندارد، د حالیکه در فرانسه قدیم نه تنها واکه های دوتایی بلکه واکه های سه تایی نیز وج...
15 صفحه اولTime-eecient State Space Search
We present two time-e cient state space algorithms for searching minimax trees. Because they are based on SSS* and Dual*, both dominate Alpha-Beta on a node count basis. Moreover, one of them is always faster in searching random trees, even when the leaf node evaluation time is negligible. The fast execution time is attributed to the recursive nature of our algorithms and to their e cient data ...
متن کاملExtended beam search for non-exhaustive state space analysis
State space explosion is a major problem in both qualitative and quantitative model checking. This article focuses on using beam search, a heuristic search algorithm, for pruning weighted state spaces while generating. The original beam search is adapted to the state space generation setting and two new variants, motivated by practical case studies, are devised. These beam searches have been im...
متن کاملOn State-Dominance Criteria in Fork-Decoupled Search
Fork-decoupled search is a recent approach to classical planning that exploits fork structures, where a single center component provides preconditions for several leaf components. The decoupled states in this search consist of a center state, along with a price for every leaf state. Given this, when does one decoupled state dominate another? Such statedominance criteria can be used to prune dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i13.26824